Computing depth orders for fat objects and related problems
نویسندگان
چکیده
منابع مشابه
Computing Depth Orders and Related Problems
Let K be a set of n non-intersecting objects in 3-space. A depth order of K, if exists, is a linear order < of the objects in K such that if K; L 2 K and K lies vertically below L then K < L. We present a new technique for computing depth orders, and apply it to several special classes of objects. Our results include: (i) If K is a set of n triangles whose xy-projections are alìfat', then a dep...
متن کاملVertical ray shooting and computing depth orders of fat objects
We present new results for three problems dealing with a set P of n convex constantcomplexity fat polyhedra in 3-space. (i) We describe a data structure for vertical ray shooting in P that has O(log n) query time and uses O(n log n) storage. (ii) We give an algorithm to compute in O(n log n) time a depth order on P if it exists. (iii) We give an algorithm to verify in O(n log n) time whether a ...
متن کاملComputing the Visibility Map of Fat Objects
We give an output-sensitive algorithm for computing the visibility map of a set of n constant-complexity convex fat polyhedra or curved objects in 3-space. Our algorithm runs in O((n + k) polylog n) time, where k is the combinatorial complexity of the visibility map. This is the first algorithm for computing the visibility map of fat objects that does not require a depth order on the objects an...
متن کاملWriting and Related Problems for EFL Students
ESL students who write in English may present written material in a rhetorical and organizational mode that reflects the pattern which is valued in their native culture and rhetoric. Considering the violation of English code of writing in the writings of Iranian students, we will notice one common characteristic: They are reluctant (or ignorant of) to write a unified paragraph. Their writing co...
متن کاملDepth efficient neural networks for division and related problems
An artificial neural network (ANN) is commonly modeled by a threshold circuit, a network of interconnected processing units called linear threshold gates. The depth of a circuit represents the number of unit delays or the time for parallel computation. The size of a circuit is the number of gates and measures the amount of hardware. It was known that traditional logic circuits consisting of onl...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 1995
ISSN: 0925-7721
DOI: 10.1016/0925-7721(95)00005-8